On the complexity of inductive definitions
نویسندگان
چکیده
We study the complexity of computable and Σ1 inductive definitions of sets of natural numbers. For we example, we show how to assign natural indices to monotone Σ1-definitions and we use these to calculate the complexity of the set of all indices of monotone Σ1-definitions which are computable. We also examine the complexity of a new type of inductive definition which we call weakly finitary monotone inductive definitions. Applications are given in proof theory and in logic programming.
منابع مشابه
LPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. Such logic formally extends logic programming, abductive logic programming and datalog, and thus formalizes the view on these formalisms as logics of (generalized) inductive definitions. The goal of this paper is to study a deductive inference method for PC(ID), w...
متن کاملSeven aspects of the information literacy experience and the complexity of the task: A review
Introduction: Information literacy experience focuses on the abilities of acquiring and using information in order to respond to customers and exchange information with other colleagues and use information in the workplace. As the task complexity increases, the experience of information literacy becomes important due to different information behaviors (ie, diversity and complexity of informatio...
متن کاملSmall Induction Recursion
There are several different approaches to the theory of data types. At the simplest level, polynomials and containers give a theory of data types as free standing entities. At a second level of complexity, dependent polynomials and indexed containers handle more sophisticated data types in which the data have an associated indices which can be used to store important computational information. ...
متن کاملA Logic for Non-Monotone Inductive Definitions
Well-known principles of induction include monotone induction and different sorts of nonmonotone induction such as inflationary induction, induction over well-founded sets and iterated induction. In this work, we define a logic formalizing induction over well-founded sets and monotone and iterated induction. Just as the principle of positive induction has been formalized in FO(LFP), and the pri...
متن کاملComparing Inductive and Circular Definitions: Parameters, Complexity and Games
Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions. 2000 Mathematics Subject Classification: 03B99 03D99 03A05 91A80 03D70 03E47 03E60 03B80 ∗ The second author would like to thank the Insti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 16 شماره
صفحات -
تاریخ انتشار 2006